Multi-Objective Optimization of Switched Reluctance Machine Design Using Jaya Algorithm (MO-Jaya)

نویسندگان

چکیده

The switched reluctance machine (SRM) design is different from the of most other machines. SRM has many parameters that have non-linear relationships with performance indices (i.e., average torque, efficiency, and so forth). Hence, it difficult to using straight forward equations iterative methods, which common for Optimization techniques are used overcome this challenge by searching best variables values within search area. In paper, optimization achieved multi-objective Jaya algorithm (MO-Jaya). algorithm, solutions moved closer solution away worst solution. a good intensification process achieved. Moreover, randomly changed achieve diversity. suggested also change solutions. better diversity achieved, as indicated results. MO-Jaya was made 8/6 6/4 SRM. Objectives iron weight. results compared non-dominated sorting genetic (NSGA-II) same conditions constraints. program in Lua programming language executed FEMM4.2 software. show success approach objective values, broad search, introduce variety optimal

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Power Flow Using the Jaya Algorithm

This paper presents application of a new effective metaheuristic optimization method namely, the Jaya algorithm to deal with different optimum power flow (OPF) problems. Unlike other population-based optimization methods, no algorithm-particular controlling parameters are required for this algorithm. In this work, three goal functions are considered for the OPF solution: generation cost minimiz...

متن کامل

An Efficient Multi-core Implementation of the Jaya Optimisation Algorithm

In this work, we propose a hybrid parallel Jaya optimisation algorithm for a multi-core environment with the aim of solving large-scale global optimisation problems. The proposed algorithm is called HHCPJaya, and combines the hyper-population approach with the hierarchical cooperation search mechanism. The HHCPJaya algorithm divides the population into many small subpopulations, each of which f...

متن کامل

Jaya Bhattarai

Upper gastrointestinal (UGI) bleed is one of the commonest medical emergencies. Cultural customs and practices may influence the development of disease conditions that may lead to UGI bleed. The purpose of this study was to compare the causes of UGI bleed in different ethnic groups among patients presenting to a large tertiary care hospital with acute UGI bleed. A retrospective study was conduc...

متن کامل

Jaya Prakash Finishing Paper

Jaya Prakash Dr. Elgin, Dr. Shaffer Biology 434W 10 February 2017 Finishing of DEUG4927010 Abstract The goal of this project was to prepare the DEUG4927010 contig—which covers the terminal 99,279 bases from the fourth chromosome of Drosophila eugracilis—for annotation. In the initial assembly of this project, there were 122 high quality discrepancies and 49 regions with low depth of coverage. N...

متن کامل

Bus Driver Scheduling Problem using TLBO and JAYA Algorithm

Bus driver scheduling problem is one of most important and complex problem faced by many companies and bus terminals. This paper attempts to solve this problem using paramterless evolutionary algorithms, TLBO and JAYA algorithm. The objective of this paper is to assign the drivers to duty on a particular day and block duty by satisfying the constraints. Algorithms are tested on four randomly ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9101107